Maximum Entropy and Variable Strength
نویسنده
چکیده
A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of proposi-tional defaults with associated strength assignments and succeeds whenever the set satisses a robustness condition. Failure of this condition implies the problem may not be suuciently speciied for a unique solution to exist. This work extends the applicability of the maximum entropy approach detailed in Goldszmidt et al., 1993], and clariies the assumptions on which the method is based.
منابع مشابه
Maximum Entropy and Variable Strength Defaults
A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of propositional defaults with associated strength assignments and succeeds whenever the set satisfies a robustness condition. Failure of this condition implies the problem may not be sufficiently specified for a unique solution to exist. This work extends the applicability o...
متن کاملExtending the Maximum Entropy Approach toVariable Strength
A generalisation of the maximum entropy (me) approach to default reasoning 7,8] to cater for variable strength defaults is presented. The assumptions on which the original work was based are reviewed and revised. A new algorithm is presented that is shown to compute the me-ranking under these more general conditions. The limitations of the revised approach are discussed and a test for the uniqu...
متن کاملModeling of the Maximum Entropy Problem as an Optimal Control Problem and its Application to Pdf Estimation of Electricity Price
In this paper, the continuous optimal control theory is used to model and solve the maximum entropy problem for a continuous random variable. The maximum entropy principle provides a method to obtain least-biased probability density function (Pdf) estimation. In this paper, to find a closed form solution for the maximum entropy problem with any number of moment constraints, the entropy is consi...
متن کاملAn Algorithm for Computing the Maximum Entropy Ranking for Variable Strength Defaults
A new algorithm for computing the maximum entropy ranking (me-ranking) over a set of variable strength defaults is given. Although this requires more information than its predecessor in terms of strengths for defaults, it has a much wider applicability, and allows for greater expressiveness in encoding default knowledge. The algorithm is shown to be sound and complete to the extent that it alwa...
متن کاملExplaining default intuitions using maximum entropy
While research into default reasoning is extensive and many default intuitions are commonly held, no one system has yet captured all these intuitions nor given a formal account to motivate them. This paper argues that the extended maximum entropy approach which incorporates variable strength defaults provides a benchmark for default reasoning that is not only objectively motivated but also sati...
متن کامل